On Hensel’s Roots and a Factorization Formula in Z[[x]]
نویسندگان
چکیده
Given an odd prime p, we provide formulas for the Hensel lifts of polynomial roots modulo p, and give an explicit factorization over the ring of formal power series with integer coe cients for certain reducible polynomials whose constant term is of the form pw with w > 1. All of our formulas are given in terms of partial Bell polynomials and rely on the inversion formula of Lagrange.
منابع مشابه
$n$-factorization Property of Bilinear Mappings
In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...
متن کاملHensel’s Lemma
That we really can keep going indefinitely is justified by Hensel’s lemma, which will provide conditions under which the root of a polynomial mod p can be lifted to a root in Zp, such as the polynomial X 2 − 7 with p = 3: its two roots mod 3 can both be lifted to square roots of 7 in Z3. We will first give a basic version of Hensel’s lemma, illustrate it with examples, and then give a stronger ...
متن کاملSpecial Cases of the Class Number Formula
Proof. Using that (Z/p)× is a cyclic group of order p − 1 (i.e. the existence of primitive roots), we see that there is a square root of −1 (that is, a non-trivial fourth root of 1) in (Z/p)× if and only if p ≡ 1 mod 4. Suppose now that p ≡ −1 mod 4, and suppose that α and β are two elements of Z[i] such that p|αβ. Then p = N(p)|N(α)N(β), and so (after relabelling if necessary) we may assume th...
متن کاملA Bijective Proof of a Factorization Formula for Macdonald Polynomials at Roots of Unity
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials H̃λ(X ; q, t) when t is specialized at a primitive root of unity. Our proof is restricted to the special case where λ is a two columns partition. We mainly use the combinatorial interpretation of Haiman, Haglund and Loehr giving the expansion of H̃λ(X ; q, t) on the monomial basis.
متن کاملNew light on Hensel’s lemma
The historical development of Hensel’s lemma is briefly discussed (section 1). Using Newton polygons, a simple proof of a general Hensel’s lemma for separable polynomials over Henselian fields is given (section 3). For polynomials over algebraically closed, valued fields, best possible results on continuity of roots (section 4) and continuity of factors (section 6) are demonstrated. Using this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014